AN AVERAGE LINEAR TIME ALGORITHM FOR WEB USAGE MINING

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Average Linear Time Algorithm For Web Usage Mining

In this paper we study the complexity of a data mining algorithm for extracting patterns from user web navigation data that was proposed in previous work [3]. The user web navigation sessions are inferred from log data and modeled as a Markov chain. The chain’s higher probability

متن کامل

An efficient algorithm for Web usage mining

With the growing popularity of the World Wide Web (Web), large volumes of data are gathered automatically by Web servers and collected in access log files. Analysis of server access data can provide significant and useful information. In this paper, we address the problem of Web usage mining, i.e. mining user patterns from one or more Web servers for finding relationships between data stored [C...

متن کامل

An Average Linear Time Algorithm for WebData

We propose a data mining algorithm for extracting patterns from user web navigation data stored in server log les. We show the average behaviour of the depth-rst search algorithm is linear time in the number of web pages accessed.

متن کامل

An Efficient Algorithm for Improved Web Usage Mining

Clustering is a web mining technique, which is a demanding field of research in which its latent applications create their own special requirements. Clustering is a method of grouping similar data into data sets, called clusters. Cluster analysis is a primary technique in conventional data analysis and many clustering methods have been recognized which requires number of clusters to be precise ...

متن کامل

A New Algorithm for High Average-utility Itemset Mining

High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information Technology & Decision Making

سال: 2004

ISSN: 0219-6220,1793-6845

DOI: 10.1142/s0219622004001021